Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging
نویسنده
چکیده
Perhaps the best known kernelization result is the kernel of size 335k for the Planar Dominating Set problem by Alber et al. [1], later improved to 67k by Chen et al. [5]. This result means roughly, that the problem of finding the smallest dominating set in a planar graph is easy when the optimal solution is small. On the other hand, it is known that Planar Dominating Set parameterized by k = |V | − k (also known as Planar Nonblocker) has a kernel of size 2k. This means that Planar Dominating Set is easy when the optimal solution is very large. We improve the kernel for Planar Nonblocker to
منابع مشابه
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs
We give the first linear kernels for Dominating Set and Connected Dominating Set problems on graphs excluding a fixed graph H as a topological minor. In other words, we give polynomial time algorithms that, for a given H-topological-minor free graph G and a positive integer k, output an H-topological-minor free graph G′ on O(k) vertices such that G has a (connected) dominating set of size k if ...
متن کاملTight Kernel Bounds for Problems on Graphs with Small Degeneracy
Kernelization is a strong and widely-applied technique in parameterized complexity. In a nutshell, a kernelization algorithm for a parameterized problem transforms a given instance of the problem into an equivalent instance whose size depends solely on the parameter. Recent years have seen major advances in the study of both upper and lower bound techniques for kernelization, and by now this ar...
متن کاملPolynomial Kernels for Hard Problems on Disk Graphs
Kernelization is a powerful tool to obtain fixed-parameter tractable algorithms. Recent breakthroughs show that many graph problems admit small polynomial kernels when restricted to sparse graph classes such as planar graphs, bounded-genus graphs or H-minor-free graphs. We consider the intersection graphs of (unit) disks in the plane, which can be arbitrarily dense but do exhibit some geometric...
متن کاملTuring Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes
We analyze the potential for provably effective preprocessing for the problems of finding paths and cycles with at least k edges. Several years ago, the question was raised whether the existing superpolynomial kernelization lower bounds for k-Path and k-Cycle can be circumvented by relaxing the requirement that the preprocessing algorithm outputs a single instance. To this date, very few exampl...
متن کاملTuring Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
The notion of Turing kernelization investigates whether a polynomial-time algorithm can solve an NP-hard problem, when it is aided by an oracle that can be queried for the answers to bounded-size subproblems. One of the main open problems in this direction is whether k-Path admits a polynomial Turing kernel: can a polynomial-time algorithm determine whether an undirected graph has a simple path...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012